Countably Generated Douglas Algebras
نویسندگان
چکیده
منابع مشابه
On Countably Closed Complete Boolean Algebras
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed. Introduction. A partially ordered set (P,<) is σ-closed if every countable chain in P has a lower bound. A complete Boolean algebra B is countably closed if (B, <) has a dense subset that is σ-closed. In [2] the first author introduced a weaker condition for Boolean algebras, game...
متن کاملCountably Generated Ideals in Rings of Continuous Functions
1. Results. Scattered results about countably2 generated ideals in C(X) are established in [2] and [4] : Op is countably generated if and only if pEX and p has a countable base of neighborhoods; Op is both prime and countably generated if and only if Mp is principal, and if and only if pEX and p is isolated; no lower prime ideal is countably generated. We generalize these as follows: if Mp is c...
متن کاملVertex algebras generated by Lie algebras
In this paper we introduce a notion of vertex Lie algebra U , in a way a “half” of vertex algebra structure sufficient to construct the corresponding local Lie algebra L(U) and a vertex algebra V(U). We show that we may consider U as a subset U ⊂ V(U) which generates V(U) and that the vertex Lie algebra structure on U is induced by the vertex algebra structure on V(U). Moreover, for any vertex ...
متن کاملSimple Conformal Algebras Generated by Jordan Algebras
1 Background and Motivation We start with an example of affine Kac-Moody algebras and the Virasoro algebra. In this talk, F will be a field with characteristic 0, and all the vector spaces are assumed over F. Denote by Z the ring of integers and by N the set of nonnegative integers. Let 2 ≤ n ∈ N. Set sl(n,F) = {A ∈ Mn×n(F) | tr A = 0}, (1.1) 〈A,B〉 = tr AB for A,B ∈ sl(n,F), (1.2) where Mn×n(F)...
متن کاملOn Finitely Generated Models of Theories with at Most Countably Many Nonisomorphic Finitely Generated Models
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We introduce a notion of rank of finitely generated models and we prove, when T has at most countably many nonisomorphic finitely generated models, that every finitely generated model has an ordinal rank. This rank is used to give a property of finitely generated mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1987
ISSN: 0002-9947
DOI: 10.2307/2000488